A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولDistributed Approximation of Maximum Independent Set and Maximum Matching
We present a simple distributed ∆-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS(G) · logW ) rounds, where ∆ is the maximum degree, MIS(G) is the number of rounds needed to compute a maximal independent set (MIS) on G, and W is the maximum weight of a node. Plugging in the best known algorithm for MIS gives a randomized solution ...
متن کاملHybrid Heuristic for the Maximum-Weight Independent Set Problem
We propose an approximate algorithm for finding the maximum-weight independent set of a given graph of n nodes with associated weights. It combines three different heuristics, and its running time is O(n2) in the practice. We also propose a set of random graphs for testing and comparing the maximumweight independent set algorithms. This graphs are easy to identically generate on any computer ca...
متن کاملA Variant of the Maximum Weight Independent Set Problem
We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w : V → R, a budget function b : V → Z, and a positive integer B. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A k-budgeted...
متن کاملA Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs∗
Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk in one of its endpoints. Outerstring graphs were introduced in 1991 and are amongst the most general classes of intersection graphs studied, including among others, chordal graphs and interval filament graphs. To date no polynomial time algorithm is known for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/9790629